Ergodicity for p-adic continued fraction algorithms
نویسندگان
چکیده
Following Schweiger’s generalization of multidimensional continued fraction algorithms, we consider a very large family p-adic which include Schneider’s algorithm, Ruban’s and the Jacobi–Perron algorithm as special cases. The main result is to show that all transformations in are ergodic with respect Haar measure.
منابع مشابه
P -adic Continued Fractions
Continued fractions in R have a single definition and algorithms for approximating them are well known. There also exists a well known result which states that √ m, m ∈ Q, always has a periodic continued fraction representation. In Qp, the field of p-adics, however, there are competing and non-equivalent definitions of continued fractions and no single algorithm exists which always produces a p...
متن کاملContinued Fraction Algorithms, Functional Operators, and Structure Constants Continued Fraction Algorithms, Functional Operators, and Structure Constants 1 Continued Fraction Algorithms, Functional Operators, and Structure Constants
Continued fractions lie at the heart of a number of classical algorithms like Euclid's greatest common divisor algorithm or the lattice reduction algorithm of Gauss that constitutes a 2-dimensional generalization. This paper surveys the main properties of functional operators, |transfer operators| due to Ruelle and Mayer (also following L evy, Kuzmin, Wirsing, Hensley, and others) that describe...
متن کامل$3$-dimensional Continued Fraction Algorithms Cheat Sheets
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of R. We consider multidimensional continued fraction algorithms that acts symmetrically on the positive cone R+ for d = 3. We include well-known and old ones (Poincaré, Brun, Selmer, Fully Subtrac...
متن کاملSome aspects of multidimensional continued fraction algorithms
Many kinds of algorithms of continued fraction expansions of dimension s(≥ 2) have been studied starting with K.G.J.Jacobi(1804-1851), for example, see [14]. For s = 1, we know Lagrange’s theorem related to periodic continued fractions and real quadratic irrationals. But, even for real cubic irrationalities, there appeared no suitable algorithms (of dimension 2). In this section, we roughly exp...
متن کاملOn some symmetric multidimensional continued fraction algorithms
We compute explicitly the density of the invariant measure for the Reverse algorithm which is absolutely continuous with respect to Lebesgue measure, using a method proposed by Arnoux and Nogueira. We also apply the same method on the unsorted version of Brun algorithm and Cassaigne algorithm. We illustrate some experimentations on the domain of the natural extension of those algorithms. For so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2021
ISSN: ['0019-3577', '1872-6100']
DOI: https://doi.org/10.1016/j.indag.2021.04.001